Real-Time Moving Target Search
نویسندگان
چکیده
In this paper, we propose a real-time moving target search algorithm for dynamic and partially observable environments, modeled as grid world. The proposed algorithm, Real-time Moving Target Evaluation Search (MTES), is able to detect the closed directions around the agent, and determine the best direction that avoids the nearby obstacles, leading to a moving target which is assumed to be escaping almost optimally. We compared our proposal with Moving Target Search (MTS) and observed a significant improvement in the solution paths. Furthermore, we also tested our algorithm against A* in order to report quality
منابع مشابه
State Abstraction for Real-time Moving Target Pursuit: A Pilot Study
The pursuit of moving targets in real-time environments such as computer games and robotics presents several challenges to situated agents. A priori unknown state spaces and the need to interleave acting and planning limits the applicability of traditional search, learning, and adversarial game-tree search methods. In this paper we build on the previous idea of hierarchical state abstraction, s...
متن کاملAlgorithm Comparison on Moving-Target Problems
The objective of our project is to compare the performances of the following algorithms: MTS, PR LRTS, PRA* and Trailblazer, on moving targets among static obstacles. The aspects in our interest of comparison consist of memory requirement, first move delay, and number of moves needed to catch the target. At this point, we plan to work on the target that moves away from the chasing agent. With t...
متن کاملMoving Target Search with Subgoal Graphs
Moving Target Search (MTS) is a dynamic path planning problem, where an agent is trying to reach a moving entity with a minimum path cost. Problems of this nature can be found in video games and dynamic robotics, which require fast processing time (real time). In this work, we introduce a new algorithm for this problem the Moving Target Search with Subgoal Graphs (MTSub). MTSub is based on envi...
متن کاملUtilizing Dual Information for Moving Target Search Trajectory Optimization
Various recent events have shown the enormous importance of maritime search-and-rescue missions. By reducing the time to find floating victims at sea, the number of casualties can be reduced. A major improvement can be achieved by employing autonomous aerial systems for autonomous search missions, allowed by the recent rise in technological development. In this context, the need for efficient s...
متن کاملApplying Coordination in Moving Target Search (MTS) Algorithm
Multi Agent System, where multiple agents concurrently and autonomously search to find a target, is regarded as a promising paradigm for future distributed computing. Agents often do not know the terrain in advance but automatically observe it within a certain range around it. In real time heuristic search such as Moving Target search (MTS), we have to commit a move within a limited search hori...
متن کامل